Branch decomposition heuristics for linear matroids
نویسندگان
چکیده
منابع مشابه
Branch decomposition heuristics for linear matroids
This paper presents two new heuristics which utilize classification and max-flow algorithm respectively to derive near-optimal branch decompositions for linear matroids. In the literature, there are already excellent heuristics for graphs, however, no practical branch decomposition methods for general linear matroids have been addressed yet. Introducing a “measure” which compares the “similarit...
متن کاملHeuristics for Domain Decomposition
The domain decomposition method embodies large potentials for a parallelization of FEM methods. In this data-parallel approach, the domain of interest is partitioned into smaller subdomains, either before the mesh generation or afterwards (mesh partitioning). The subdomains are assigned to processors that calculate the corresponding part of the approximation. The mesh decomposition and assignme...
متن کاملDynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs
This paper deals with methods exploiting tree-decomposition approaches for solving weighted constraint networks. We consider here the practical efficiency of these approaches by defining three classes of variable orders more and more dynamic which preserve the time complexity bound. Then, we extend this theoretical time complexity bound to increase the dynamic aspect of these orders. For that, ...
متن کاملDynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs
This paper deals with methods exploiting tree-decomposition approaches for solving weighted constraint networks. We consider here the practical efficiency of these approaches by defining five classes of variable orders more and more dynamic which preserve the time complexity bound. For that, we define extensions of this theoretical time complexity bound to increase the dynamic aspect of these o...
متن کاملPrimal Heuristics for Branch-and-Price Algorithms
In this paper, we present several primal heuristics which we implemented in the branch-and-price solver GCG based on the SCIP framework. This involves new heuristics as well as heuristics from the literature that make use of the reformulation yielded by the Dantzig-Wolfe decomposition. We give short descriptions of those heuristics and briefly discuss computational results. Furthermore, we give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2013
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2012.11.004